Edgewise Cohen-Macaulay connectivity of partially ordered sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shellable and Cohen-macaulay Partially Ordered Sets

In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of chains is shellable. It is shown that all admissible lattices (including all finite semimodular and supersolvable lattices) and all bounded locally semimodular finite posets are shellable. A technique for labeling the edges of the Hasse diagram of certain lattices, due to...

متن کامل

Cohen-Macaulay Partially Ordered Sets with Pure Resolutions

1.1. Let V = {x1, x2, . . . , xv} be a finite set, called the vertex set, and 1 a simplicial complex on V . Thus 1 is a collection of subsets of V such that (i) {xi } ∈ 1 for every 1 ≤ i ≤ v and (ii) σ ∈ 1, τ ⊂ σ ⇒ τ ∈ 1. Each element σ of 1 is called a face of 1. Set d = max{#(σ ); σ ∈ 1}. Here #(σ ) is the cardinality of σ as a finite set. Then the dimension of 1 is defined by dim1 = d − 1. A...

متن کامل

The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes

The absolute order is a natural partial order on a Coxeter group W . It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W . By use of a notion of constructibility for partially ordered sets, it is proved that the absolute order on the symmetric group is homotopy Cohen–Macaulay. This...

متن کامل

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

Shellability and Higher Cohen-macaulay Connectivity of Generalized Cluster Complexes

Let Φ be a finite root system of rank n and let m be a positive integer. It is proved that the generalized cluster complex ∆m(Φ), introduced by S. Fomin and N. Reading, is (m + 1)-Cohen-Macaulay, in the sense of Baclawski. This statement was conjectured by V. Reiner. More precisely, it is proved that the simplicial complex obtained from ∆m(Φ) by removing any subset of its vertex set of cardinal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MATHEMATICA SCANDINAVICA

سال: 2018

ISSN: 1903-1807,0025-5521

DOI: 10.7146/math.scand.a-97270